Optimal Pole Assignment of Linear Systems by the Sylvester Matrix Equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

On Successive Pole Assignment by Linear-Quadratic Optimal Feedbacks

This paper studies a method of shifting poles of linear constant systems via LQ optimal feedback. By making use of a solution to the so-called inverse regulator problem, this method enables us to shift poles successively by pairs while maintaining the well-known advantages of LQ regulators. Polynomial fractional representation is effectively used both to characterize the maximal pole-assignable...

متن کامل

Pole Assignment Of Linear Discrete-Time Periodic Systems In Specified Discs Through State Feedback

The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

Robust Pole Assignment via Sylvester Equation Based State Feedback Parametrization

By using a Sylvester equation based parametrization, the minimum norm robust pole assignment problem for linear time-invariant systems is formulated as an unconstrained minimization problem for a suitably chosen cost function. The derived explicit expression of the gradient of the cost function allows the efficient solution of the minimization problem by using powerful gradient search based min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 2014

ISSN: 1085-3375,1687-0409

DOI: 10.1155/2014/301375